#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
const int N=2e5+10;
#define INF 0x3f3f3f3f;
typedef long long int ll;
#define close(); std::ios::sync_with_stdio(false);cin.tie(0),cout.tie(0);
//----------------------------------------------------------------------------//
int n,a,b;
bool st[110];
void solve()
{
	cin>>n;
	cin>>a>>b;

	memset(st,false,sizeof st);
	int n1=n/2;

	vector<int> vl,vr;
	vl.push_back(a);
	vr.push_back(b);
	st[a]=true;
	st[b]=true;

	for(int i=1;i<=n;i++) if(!st[i]&&vr.size()<n1) vr.push_back(i),st[i]=true;
	for(int i=1;i<=n;i++) if(!st[i]&&vl.size()<n1) vl.push_back(i),st[i]=true;

	for(auto&k:vl) if(k<a) {cout<<-1<<'\n';return;}
	for(auto&k:vr) if(k>b) {cout<<-1<<'\n';return;}

	for(auto&k:vl) cout<<k<<" ";
	for(auto&k:vr) cout<<k<<" ";
	cout<<'\n';

	
}

int main()
{
	close();
	int T; cin>>T;
	while (T--) solve();
	return 0;
}
//全排列
//左最小a 右最大b